Distance preserving flattening of surface sections
نویسندگان
چکیده
منابع مشابه
Area-Preserving Surface Flattening Using Lie Advection
In this paper, we propose a novel area-preserving surface flattening method, which is rigorous in theory, efficient in computation, yet general in application domains. Leveraged on the state-of-the-art flattening techniques, an infinitesimal area restoring diffeomorphic flow is constructed as a Lie advection of differential 2-forms on the manifold, which yields strict equality of area elements ...
متن کاملColon Visualization Using Shape Preserving Flattening
Virtual colonoscopy is a well-known screening modality for colon cancer, and virtual colon flattening techniques have been proposed to map the 3D surface to the 2D domain. Performing this flattening with conformal geometry allows for the local shapes to be preserved. We explore here how these shape preserving flattened maps can be used for visualization of the colon and to enhance the VC enviro...
متن کاملB-Spline Surface Approximation to Cross-Sections Using Distance Maps
The shape reconstruction of a 3D object from its 2D crosssections is important for reproducing it by NC machining or rapid prototyping. In this paper, we present a method of surface approximation to cross-sections with multiple branching problems. In this method, we first decompose each multiple branching problem into a set of single branching problems by providing a set of intermediate contour...
متن کاملComparison of Three Staining Methods of Vibratome and Paraffin Sections in Preserving Thickness of Rat Hippocampal Sections
Purpose: To determine the optimal technique for maintaining hippocampus vibratome sections volume. Materials and Methods: This experimental study was performed on three rat hippocampus. The first hippocampus was embedded in paraffin and using rotary microtome forty sections were cut in a nominal thickness of 100 micrometer. They were then ordinary stained. The two others were cut into 80 sectio...
متن کاملOn Distance Preserving and Sequentially Distance Preserving Graphs
A graph H is an isometric subgraph of G if dH(u, v) = dG(u, v), for every pair u, v ∈ V (H). A graph is distance preserving if it has an isometric subgraph of every possible order. A graph is sequentially distance preserving if its vertices can be ordered such that deleting the first i vertices results in an isometric subgraph, for all i ≥ 1. We give an equivalent condition to sequentially dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2006
ISSN: 1077-2626
DOI: 10.1109/tvcg.2006.7